Shuffled Frog Leaping Algorithm with Non-Dominated Sorting for Dynamic Weapon-Target Assignment
نویسندگان
چکیده
The dynamic weapon target assignment (DWTA) problem is of great significance in modern air combat. However, DWTA a highly complex constrained multi-objective combinatorial optimization problem. An improved elitist non-dominated sorting genetic algorithm-II (NSGA-II) called the shuffled frog leaping algorithm (NSFLA) proposed to maximize damage enemy targets and minimize self-threat combat constraints. In NSFLA, (SFLA) introduced NSGA-II replace inside evolutionary scheme (GA), displaying low speed heterogeneous space search defects. Two improvements have also been raised promote internal performance SFLA. Firstly, local evolution scheme, novel crossover mechanism, ensures that each individual participates updating instead only worst ones, which can expand diversity population. Secondly, discrete adaptive mutation based on function change rate applied balance global search. Finally, verified various scenarios. results show NSFLA has apparent advantages solution quality efficiency, especially many aircraft environment.
منابع مشابه
Centroid Mutation Embedded Shuffled Frog-Leaping Algorithm
Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...
متن کاملAn Improved Shuffled Frog Leaping Algorithm ⋆
In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...
متن کاملTwo-Phases Learning Shuffled Frog Leaping Algorithm
In order to overcome the drawbacks of standard shuffled frog leaping algorithm that converges slowly at the last stage and easily falls into local minima, this paper proposed two-phases learning shuffled frog leaping algorithm. The modified algorithm added the elite Gaussian learning strategy in the global information exchange phase, updated frog leaping rule and added the learning capability t...
متن کاملModified Shuffled Frog-leaping Algorithm with Dimension by Dimension Improvement
Shuffled leap frog algorithm (SFLA) is a new nature-inspired intelligent algorithm, which uses the whole update and evaluation strategy on solutions. For solving multi-dimension function optimization problems, this strategy will deteriorate the convergence speed and the quality of solution of algorithm due to interference phenomena among dimensions. To overcome this shortage, a dimension by dim...
متن کاملAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2023
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2023.000102